Canad. J. Math. Vol), 2005 pp. 328–337 On a Conjecture of Birch and Swinnerton-Dyer Wentang Kuo and M. Ram Murty Abstract. Let E/Q be an elliptic curve defined by the equation y 2 = x3 + ax + b. For a prime p,

Source URL: www.mast.queensu.ca

• Conjectures
• Analytic number theory
• Millennium Prize Problems
• Number theory
• Elliptic curve
• Group theory
• Birch and Swinnerton-Dyer conjecture
• Riemann hypothesis
• Abc conjecture
• Chain rule for Kolmogorov complexity

The Tonelli-Shanks algorithm Ren´e Schoof, Roma 20 dicembre 2008 let p > 2 be prime. We describe an algorithm (due to A. Tonelli (Atti Accad. Linceiand D. Shanks (1970ies)) to compute a square root of a given sq

Source URL: www.mat.uniroma2.it

• Algebraic number theory
• Modular arithmetic
• TonelliShanks algorithm
• Field theory
• Cyclotomic unit
• Trigonometry in Galois fields

FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa

Source URL: davidlowryduda.com

• Integer factorization algorithms
• Mathematics
• Cryptography
• Number theory
• Quadratic sieve
• Euclidean algorithm
• RSA
• Prime number
• Factorization
• Trial division
• General number field sieve
• Rational sieve

Around the Möbius function Kaisa Matomäki (University of Turku), Maksym Radziwill (Rutgers University) The Möbius function plays a central role in number theory; both the prime number theorem and the Riemann Hypothesi

Source URL: www.7ecm.de

Genus 2, faster Gaudry, Kohel, Smith Genus 1 and 2 Point Counting for Genus 2 Curves

Source URL: ecc2011.loria.fr

• Mathematics
• Abstract algebra
• Group theory
• Algebra
• Prime number
• Elliptic curve
• Elliptic curve cryptography
• Finite fields

A Heuristic for the Prime Number Theorem This article appeared in The Mathematical Intelligencer 28:–9, and is copyright by SpringerVerlag. Posted with permission. Hugh L. Montgomery 1 , University of Michiga

Source URL: stanwagon.com

A glimpse of sample topics • Elementary number theory. A positive integer n > 1 is prime if it is exactly divisible only by 1 and by itself; for example 2, 3, 5, 7, 11, 13, 17, ... are primes, while 6 is not. These ar

Source URL: people.math.ethz.ch

• Geometry
• Mathematics
• Space
• Analytic geometry
• Differential geometry
• Number theory
• Tangent
• Prime number
• Lie sphere geometry
• Tangent lines to circles

The Biotic Pattern of Prime Numbers Supports the Bios Theory of Creative Evolution from Radiation to Complexity H. Sabelli, Chicago Center for Creative Development. Chicago, IL 60614

Source URL: necsi.edu

• Analytic number theory
• Prime number
• Recurrence plot
• Time series
• Chaos theory
• Riemann zeta function

AUTOMORPHISMS OF FUSION SYSTEMS OF SPORADIC SIMPLE GROUPS BOB OLIVER Abstract. We prove here that with a very small number of exceptions, when G is a sporadic simple group and p is a prime such that the p-fusion system o

Source URL: www.math.univ-paris13.fr

• Algebra
• Abstract algebra
• Mathematics
• Finite groups
• Group theory
• Lie groups
• Morphisms
• Projective geometry
• Automorphism
• XTR
• PSL
• Representation theory

cvec Compact vectors over finite fields Max Neunhöffer

Source URL: www.gap-system.org

• Algebra
• Abstract algebra
• Mathematics
• Field theory
• Computer algebra
• Polynomials
• Finite field
• Field
• Matrix
• Vector space
• Characteristic
• Prime number